AU2444002_Richa_Saraiya
Submission at 2024-09-09 10:45:36
'''
class node:
def __init__(self):
self.data = None
self.next = None
'''
def removeDuplicates(head,l1):
l1=l1.val
l1.val=l1.head
if l1.val >= l1:
newhead = removeDuplicates(list1.head)
return l1.head
Submission at 2024-09-09 10:57:58
# write cdef power(n):
def power(n):
for i in range(n):
if n== power[4,n]:
return True
return False
Submission at 2024-09-09 11:11:32
n=int(input("enter number"))
def pot (n):
if n<4:
return ("False")
elif n==4:
return ("True")
else:
pot((n/4))
print(pot(n))
Submission at 2024-10-07 10:03:22
def combo(nums):
sum=0
for num in nums:
if len(num) <4:
return -1
num[i] , num[j] = 0,0
for i , j in num:
if num > i and num>j:
num[i]+=1
num[j]+=1
sum=[num[i]+num[j]]
return min[sum]
Submission at 2024-10-07 10:23:26
def pair(nums):
for num in nums:
if len(num) !=4:
return -1
i,j=0,0
for num in nums:
pairs=num.split()
if pairs <= num:
i+=1
j+=1
sum = pair[i] + pair[j]
return min[sum]
Submission at 2024-10-07 10:49:26
def candyeat (box,candy):
box =1
candy = box
while True :
if box >=1:
candy-=1
elif box == 0:
candy+=1
return candy
Submission at 2024-10-07 10:51:37
def candyeat (box,candy):
candy = 1
while True :
if box >=1:
candy-=1
elif box == 0:
candy+=1
return candy
Submission at 2024-10-07 11:01:22
def can(box,c):
candy=0
b=len(box)
while True:
if len(b)>=1:
candy-=1
elif len(b) == 0:
candy+=(b(len)+1)
return candy
Submission at 2024-10-07 11:01:23
def can(box,c):
candy=0
b=len(box)
while True:
if len(b)>=1:
candy-=1
elif len(b) == 0:
candy+=(b(len)+1)
return candy
Submission at 2024-10-07 11:02:41
def can(box,c):
candy=0
b=len(box)
while True:
for b in box:
if len(b)>=1:
candy-=1
elif len(b) == 0:
candy+=(b(len)+1)
return candy
Submission at 2024-10-28 10:46:11
#User function Template for python3
def findMax(node,root):
if root!=null:
node1= root(a)
node2= root(b)
if node1 < node2:
node1 = max
else:
node2 = max
print(max)
#code here
Submission at 2024-10-28 10:46:11
#User function Template for python3
def findMax(node,root):
if root!=null:
node1= root(a)
node2= root(b)
if node1 < node2:
node1 = max
else:
node2 = max
print(max)
#code here
Submission at 2024-11-25 10:08:42
n=3
count=0
name = int(input("enter name"))
for n in name:
n==count(name)
count++
if n==count(name):
print("Hello",name "!")
Submission at 2024-11-25 10:08:43
n=3
count=0
name = int(input("enter name"))
for n in name:
n==count(name)
count++
if n==count(name):
print("Hello",name "!")
Submission at 2024-11-25 10:11:20
n=3
count=0
name = int(input("enter name"))
for n in name:
n==count(name)
count++;
if n==count(name):
print("Hello",name "!")
Submission at 2024-11-25 10:12:48
n=3
count=0
name = int(input("enter name"))
for n in name:
if n==count(name):
count++
if n==count(name):
print("Hello",name "!")
Submission at 2024-11-25 10:15:06
n=3
count=0
name = int(input("enter name"))
for n in name:
if n==count(name):
count++
if n==count(name):
print("Hello" name "!")
Submission at 2024-11-25 10:25:42
prob=[1,2,3,4,5,7]
count=0
if prob[i] %2 = =0:
prob[i] = a
count(a)++
else :
prob[i] = b
cout(b)++
print(count(a) , count(b))
Submission at 2024-11-25 10:25:52
prob=[1,2,3,4,5,7]
count=0
if prob[i] %2 = =0:
prob[i] = a
count(a)++
else :
prob[i] = b
cout(b)++
print(count(a) , count(b))
Submission at 2024-11-25 10:27:42
prob=[1,2,3,4,5,7]
count=0
if prob[i] %2 = 0:
prob[i] = a
count(a)++
else :
prob[i] = b
cout(b)++
print(count(a) , count(b))
Submission at 2024-11-25 10:48:55
prob=[1,2,3,4,5,7]
count=0
if prob[i] %2=0:
prob[i] = a
count[a]++
else :
prob[i] = b
cout[b]++
print(count[b] , count[a])
Submission at 2024-11-25 11:15:21
i=5
for i in range(5,1):
i=i-1
print("\n*****")
Submission at 2024-11-25 11:15:22
i=5
for i in range(5,1):
i=i-1
print("\n*****")
Submission at 2024-11-25 11:26:36
i=5
j=5
print(" *****")
print ("****")
print ("***")
print ("**")
print ("*")